منابع مشابه
Isomorphism on Fuzzy Graphs
In this paper, the order, size and degree of the nodes of the isomorphic fuzzy graphs are discussed. Isomorphism between fuzzy graphs is proved to be an equivalence relation. Some properties of self complementary and self weak complementary fuzzy graphs are discussed. Keywords—complementary fuzzy graphs, co-weak isomorphism, equivalence relation, fuzzy relation, weak isomorphism.
متن کاملMeasurement Isomorphism of Graphs
The d-measurement set of a graph is its set of possible squared edge lengths over all d-dimensional embeddings. In this note, we define a new notion of graph isomorphism called d-measurement isomorphism. Two graphs are d-measurement isomorphic if there is agreement in their d-measurement sets. A natural question to ask is “what can be said about two graphs that are d-measurement isomorphic?” In...
متن کاملIsomorphism On Interval-Valued Fuzzy Graphs
Abstract: The present paper is focusing on the order, size and degree of the nodes of the interval-valued fuzzy graphs, which are isomorphic. Isomorphism between Interval-valued fuzzy graphs is proved to be an equivalence relation, whereas the Weak isomorphism is proved to be a partial order. Few properties of interval valued fuzzy graphs, which are self complementary, are discussed.
متن کاملOn Distances between Isomorphism Classes of Graphs
Various measures of distance between (the isomorphism classes of) two graphs have been proposed. These include measures proposed by Zelinka [6],[7], Baláž, Koča, Kvasńıčka & Sekanina [1] and Johnson [4]. Further, there is the edge rotation distance of Chartrand, Saba & Zou [3] and the edge shift distance of Johnson [5]. It is on the latter two that we build. For terminology and notation not exp...
متن کاملIsomorphism criterion for monomial graphs
Let q be a prime power, Fq be the field of q elements, and k;m be positive integers. A bipartite graph G 1⁄4 Gqðk;mÞ is defined as follows. The vertex set of G is a union of two copies P and L of two-dimensional vector spaces over Fq, with two vertices ðp1;p2Þ 2 P and 1⁄2 l1; l2 2 L being adjacent if and only if p2 þ l2 1⁄4 p 1 l 1 . We prove that graphs Gqðk ;mÞ and Gq0 ðk 0;m0Þ are isomorphic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2018
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v117i1.7